Rate-Based Stochastic Fusion Calculus and Continuous Time Markov Chains

نویسندگان

  • Gabriel Ciobanu
  • Angelo Troina
چکیده

This paper presents a stochastic fusion calculus suitable to describe systems involving general patterns of interactions. We start from fusion calculus [8] which is a symmetric generalisation of the π-calculus, and present a rate-based stochastic fusion calculus, providing a concise and compositional way to describe the behaviour of complex systems by using probability distributions. We provide the semantics of stochastic fusion calculus by using rate-based transition systems [4] in the elegant and general variant proposed by De Nicola et al. [2]. The stochastic nature of the new transition systems is given by the fact that transition labels represent actions, and the transition result is a function associating a positive real value to each possible target process, expressing the stochastic rate of an exponential distribution modelling the duration of the transition. For two processes running in parallel, we define the distribution of their synchronisation using their apparent rates. Associativity of parallel composition is a particularly desirable property either in the context of network and distributed systems, either in the context of biological systems, where parallel composition is often used to model molecular populations. Following the approach proposed in [2], associativity of the parallel composition operator is guaranteed in the rate-based stochastic semantics of the fusion calculus (differently to what happens in the stochastic π-calculus [9] and in a previous formalisation of a stochastic fusion calculus [1]). We extend the notion of hyperbisimulation to stochastic fusion calculus, and prove that the stochastic hyperequivalence is a congruence. The rate-based transition system resulting from a stochastic fusion process leads the expression of a continuous time Markov chain which preserves the notion of hyperequivalence. The modelling power of the stochastic fusion calculus is suggested by an example where we formalise some of the one-to-many interactions occurring between a plant root and a particular kind of fungi in the arbuscular mycorrhizal symbiosis. A quantitative simulation is performed using the PRISM model checker on the continuous time Markov chain extracted from the rate-based transition system describing such interactions by means of stochastic fusion processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry

We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...

متن کامل

Review on Stochastic Comparison Relations

The report offers an overview of some stochastic simulation and bisimulation relations based on continuous-time Markov chains and on stochastic (possibly Markovian) process algebras.

متن کامل

On $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov‎ ‎processes

‎In the present paper we investigate the $L_1$-weak ergodicity of‎ ‎nonhomogeneous continuous-time Markov processes with general state‎ ‎spaces‎. ‎We provide a necessary and sufficient condition for such‎ ‎processes to satisfy the $L_1$-weak ergodicity‎. ‎Moreover‎, ‎we apply‎ ‎the obtained results to establish $L_1$-weak ergodicity of quadratic‎ ‎stochastic processes‎.

متن کامل

Aggregation Methods for Markov Reward Chains with Fast and Silent Transitions

We analyze derivation of Markov reward chains from intermediate performance models that arise from formalisms for compositional performance analysis like stochastic process algebras, (generalized) stochastic Petri nets, etc. The intermediate models are typically extensions of continuous-time Markov reward chains with instantaneous labeled transitions. We give stochastic meaning to the intermedi...

متن کامل

The Attributed Pi Calculus

The attributed pi calculus (π(L)) forms an extension of the pi calculus with attributed processes and attribute dependent synchronization. To ensure flexibility, the calculus is parametrized with the language L which defines possible values of attributes. π(L) can express polyadic synchronization as in pi@ and thus diverse compartment organizations. A non-deterministic and a stochastic semantic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012